package leetcode.weekly.week336;

//Solution1Test
public class Solution1 {

	public int vowelStrings(String[] words, int left, int right) {
		int ans = 0;
		for (int i = left; i <= right; i++) {
			String word = words[i];
			if ("aeiou".contains("" + word.charAt(0)) && "aeiou".contains("" + word.charAt(word.length() - 1))) {
				ans++;
			}
		}
		return ans;
	}
}
